writing pushdown acceptor meaning in English
写入不推接收器
Examples
- Existing complexity proofs on the circularity problem of ags are based on automata theory , such as writing pushdown acceptor and alternating turing machines
目前对属性文法循环性问题复杂度的证明，多基于自动机理论，如写入推出接受器、交替涂林机等。